public class maxDepth {
    /*int maxDepth(Node* root) {
    queue<Node*> que;
    if (root != NULL) que.push(root);
    int depth = 0;
    while (!que.empty()) {
        int size = que.size();
        depth++; // 记录深度
        for (int i = 0; i < size; i++) {
            Node* node = que.front();
            que.pop();
            for (int j = 0; j < node->children.size(); j++) {
                if (node->children[j]) que.push(node->children[j]);
            }
        }
    }
    return depth;
}*/
}
